Technical Note—Some Simpler Bounds on the Mean Queuing Time
نویسندگان
چکیده
منابع مشابه
on the relationship between linguistic, visual-spatial, interpersonal intelligences and technical translation quality
abstract this study tried to investigate whether there was any significant relationship between technical translation quality of the senior english translation students and their levels of verbal-linguistic, visual-spatial and interpersonal intelligences. in order to investigate the research questions, the researcher selected a hundred senior english translation students from three universitie...
Lower Bounds on Queuing and Loss at Highly Multiplexed Links
Explicit and delay-driven congestion control protocols strive to preclude overflow of link buffers by reducing transmission upon incipient congestion. In this paper, we explore fundamental limitations of any congestion control with respect to minimum queuing and loss achievable at highly multiplexed links. We present and evaluate an idealized protocol where all flows always transmit at equal ra...
متن کاملMean flow time minimization with given bounds of processing times
We consider a job shop scheduling problem under uncertain processing times and fixed precedence and capacity constraints. Each of the random processing times can take any real value between given lower and upper bounds. The goal is to find a set of schedules which contains at least one optimal schedule (with mean flow time criterion) for any admissible realization of the random processing times...
متن کاملBounds on the deviation of discrete-time Markov chains from their mean-field model
We consider a generic mean-field scenario, in which a sequence of population models, described by discretetime Markov chains (DTMCs), converges to a deterministic limit in discrete time. Under the assumption that the limit has a globally attracting equilibrium, the steady states of the sequence of DTMC models converge to the point-mass distribution concentrated on this equilibrium. In this pape...
متن کاملBounds On The Cover Time
Consider a particle that moves on a connected, undirected graph G with n vertices. At each step the particle goes from the current vertex to one of its neighbors, chosen uniformly at random. The cover time is the rst time when the particle has visited all the vertices in the graph starting from a given vertex. In this paper, we present upper and lower bounds that relate the expected cover time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1978
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.26.6.1083